Computer and Modernization ›› 2009, Vol. 1 ›› Issue (7): 12-16,2.doi: 10.3969/j.issn.1006-2475.2009.07.004

• 人工智能 • Previous Articles     Next Articles

Solving Traveling Salesman Problem by Genetic Algorithm

WANG Hui   

  1. Department of Information Technology, Jingzhou Institute of Technology Jingzhou, 434100, China
  • Received:2008-07-24 Revised:1900-01-01 Online:2009-07-10 Published:2009-07-10

Abstract: This paper introduces TSP problem and fundamental principle for genetic algorithm. Aiming at solving TSP problem,the paper expounds the utilization of genetic algorithm in code element and genetic arithmetic operators, and some processing method in the producing of the arithmetic. Finally, the paper provides experimental results and summary.

Key words: TSP, genetic algorithm, coding, genetic operation, assemble optimization

CLC Number: 

Copyright © Computer and Modernization, All Rights Reserved.
Tel: 0791-86490996 Fax: 0791-86492535 E-mail: jgsdd@163.com
Powered by Beijing Magtech Co., Ltd.